#include <cstdio>

int main( )
{
    int f[ 301 ][ 301 ], i, j, k, n, count;
    for ( i = 0; i <= 300; i++ )
        for ( j = 0; j <= 300; j++ )
            f[ i ][ j ] = 0;
    f[ 0 ][ 0 ] = f[ 1 ][ 1 ] = 1;
    for ( i = 2; i <= 300; i++ )
    {
        for ( j = 1; j * 2 - 1 <= i; j++ )
        {
            f[ i ][ j ] = 0;
            for ( k = 0; k < j; k++ )
                f[ i ][ j ] += f[ i + 1 - j * 2 ][ k ];
        }
    }
    while ( scanf("%d", &n) != EOF )
    {
        count = 0;
        for ( i = 0; i <= n; i++ )
            count += f[ n ][ i ];
        printf("%d\n", count);
    }
    return 0;
}
